Combinatorial Proofs Using Complex Weights
نویسندگان
چکیده
In 1961, Kasteleyn, Fisher, and Temperley gave a result for the number of possible tilings of a 2m× 2n checkerboard with dominoes. Their proof involves the evaluation of a complicated Pfaffian. In this thesis we investigate combinatorial strategies to evaluate the sum of evenly spaced binomial coefficients, and present steps towards a purely combinatorial proof of the 1961 result.
منابع مشابه
Higher Weights of Grassmann Codes
Using a combinatorial approach to studying the hyperplane sections of Grassmannians, we give two new proofs of a result of Nogin concerning the higher weights of Grassmann codes. As a consequence, we obtain a bound on the number of higher dimensional subcodes of the Grassmann code having the minimum Hamming norm. We also discuss a generalization of Grassmann codes .
متن کاملPath generating functions and continued fractions
This paper extends Flajolet’s (Discrete Math. 32 (1980) 125-161) combinatorial theory of continued fractions by obtaining the generating function for paths between horizontal lines, with arbitrary starting and ending points and weights on the steps. Consequences of the combinatorial arguments used to determine this result are combinatorial proofs for many classical identities involving continue...
متن کاملComputer-Assisted Proving of Combinatorial Conjectures Over Finite Domains: A Case Study of a Chess Conjecture
There are several approaches for using computers in deriving mathematical proofs. For their illustration, we provide an in-depth study of using computer support for proving one complex combinatorial conjecture – correctness of a strategy for the chess KRK endgame. The final, machine verifiable, result presented in this paper is that there is a winning strategy for white in the KRK endgame gener...
متن کاملFolder complexes and multiflow combinatorial dualities By Hiroshi
In multiflow maximization problems, there are several combinatorial duality relations, such as Ford-Fulkerson’s max-flow min-cut theorem for single commodity flows, Hu’s max-biflow min-cut theorem for two-commodity flows, Lovász-Cherkassky duality theorem for free multiflows, and so on. In this paper, we provide a unified framework for such multiflow combinatorial dualities by using the notion ...
متن کاملUncoupling Measures and Eigenvalues of Stochastic Matrices
This paper gives bounds for the uncoupling measures of a stochastic matrix P in terms of its eigenvalues. The proofs are combinatorial. We use the Matrix–Tree Theorem which represents principal minors of I−P as sums of weights of directed forests.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010